﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NStl.Linq;
using NUnit.Framework;
using NStl.Collections.Private;
using System.Collections.Generic;
using System.Collections;
using NUnit.Framework.SyntaxHelpers;
using NStl.SyntaxHelper;
namespace NStl.NUnit.ContainerFixture.HashContainer
{
    [TestFixture]
    public class HashContainerWithCollisionFixture
    {
        class Collisionaire
        {
            private static int idGen = 0;
            internal readonly int ID;
            internal readonly int hash;
            internal Collisionaire(int hash)
            {
                ID = idGen++;
                this.hash = hash;
            }
            public override bool Equals(object obj)
            {
                Collisionaire rhs = obj as Collisionaire;
                if (rhs == null)
                    return false;
                return ID == rhs.ID;
            }
            public override int GetHashCode()
            {
                return hash;
            }
        }

        private HashContainer<Collisionaire, Collisionaire> hc;
        private IList<KeyValuePair<Collisionaire, Collisionaire>> hcContent;

        [SetUp]
        public void SetUp()
        {
            hc = new HashContainer<Collisionaire, Collisionaire>(10, Project.Identity<Collisionaire>());
            hcContent = new List<KeyValuePair<Collisionaire, Collisionaire>>();
            for (int i = 0; i < 10; ++i)
            {
                Collisionaire c1 = new Collisionaire(i);
                Collisionaire c2 = new Collisionaire(i);
                hc.InsertEqual(c1);
                hc.InsertEqual(c2);

                hcContent.Add(new KeyValuePair<Collisionaire, Collisionaire>(c1, c2));
            }
        }

        [Test]
        public void InsertEqual()
        {
            Assert.AreEqual(hcContent.Count*2, hc.Count);
        }

        [Test]
        public void EqualRangeSameHashDifferentObjects()
        {
            KeyValuePair<HashContainer<Collisionaire, Collisionaire>.Iterator, HashContainer<Collisionaire, Collisionaire>.Iterator> eqr =
                hc.EqualRange(hcContent[0].Key);

            ICollection expected = new[] {hcContent[0].Key};
            ICollection actual = eqr.Key.AsCollection(eqr.Value);

            Assert.That(actual, Is.EquivalentTo(expected));
        }
        [Test]
        public void EqualRangeSameHashEqualObject()
        {
            hc.InsertEqual(hcContent[0].Key);

            KeyValuePair<HashContainer<Collisionaire, Collisionaire>.Iterator, HashContainer<Collisionaire, Collisionaire>.Iterator> eqr =
                hc.EqualRange(hcContent[0].Key);

            ICollection expected = new Collisionaire[] { hcContent[0].Key, hcContent[0].Key };
            ICollection actual = eqr.Key.AsCollection(eqr.Value);

            Assert.That(actual, Is.EquivalentTo(expected));
        }

        [Test]
        public void FindFirstCollisionKey()
        {
            HashContainer<Collisionaire, Collisionaire>.Iterator i =
                hc.Find(hcContent[0].Key);

            Assert.AreNotEqual(hc.End(), i);

            Assert.AreEqual(hcContent[0].Key, i.Value);
        }
        [Test]
        public void FindSecondCollisionKey()
        {
            HashContainer<Collisionaire, Collisionaire>.Iterator i =
                hc.Find(hcContent[0].Value);

            Assert.AreNotEqual(hc.End(), i);

            Assert.AreEqual(hcContent[0].Value, i.Value);
        }

        [Test]
        public void EraseSecondCollisionEntry()
        {
            HashContainer<Collisionaire, Collisionaire>.Iterator i =
                hc.Find(hcContent[0].Value);

            hc.Erase(i);

            Assert.AreEqual(hcContent.Count * 2 - 1, hc.Count);

            i = hc.Find(hcContent[0].Value);

            Assert.AreEqual(hc.End(), i);
        }
        [Test]
        public void EraseFirstCollisionEntry()
        {
            HashContainer<Collisionaire, Collisionaire>.Iterator i =
                hc.Find(hcContent[0].Key);

            hc.Erase(i);

            Assert.AreEqual(hcContent.Count * 2 - 1, hc.Count);

            i = hc.Find(hcContent[0].Key);

            Assert.AreEqual(hc.End(), i);
        }
    }
}
